On the Maximum Diameter of Path-Pairable Graphs
نویسندگان
چکیده
منابع مشابه
On the maximum diameter of path-pairable graphs
A graph is path-pairable if for any pairing of its vertices there exist edge disjoint paths joining the vertices in each pair. We obtain sharp bounds on the maximum possible diameter of path-pairable graphs which either have a given number of edges, or are cdegenerate. Along the way we show that a large family of graphs obtained by blowing up a path is path-pairable, which may be of independent...
متن کاملNote on the diameter of path-pairable graphs
A graph on 2k vertices is path-pairable if for any pairing of the vertices the pairs can be joined by edge-disjoint paths. The so far known families of path-pairable graphs have diameter of atmost 3. In this paperwe present an infinite family of path-pairable graphswith diameter d(G) = O( √ n) where n denotes the number of vertices of the graph. We prove that our example is extremal up to a con...
متن کاملOn the maximum degree of path-pairable planar graphs
A graph is path-pairable if for any pairing of its vertices there exist edge-disjoint paths joining the vertices in each pair. We investigate the behaviour of the maximum degree in path-pairable planar graphs. We show that any n-vertex path-pairable planar graph must contain a vertex of degree linear in n.
متن کاملPath-pairable Graphs
A graph of even order is called path-pairable, if for any pairing of its vertices, there exist edge disjoint paths connecting the paired vertices. Extrernal problerns for path-pairable graphs with restrictions on the maxirnurn degree will be considered. In particular, let f(n, k) denote the rninirrnun nurnber of edges in a path-pair able graph of order nand rnaxirnum degree k. Exact values of j...
متن کاملThree-regular path pairable graphs
A graph G with at least 2k vertices is k-path pairable if for any k pairs of distinct vertices 9f G there are k edge disjoint paths between the pairs. It will be shown for any positive integer k that there is a k-path pairable graph of maximum degree three.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Graphs and Combinatorics
سال: 2019
ISSN: 0911-0119,1435-5914
DOI: 10.1007/s00373-019-02099-y